Stability Analysis of Fast Toeplitz Linear System Solvers
نویسنده
چکیده
We present a numerical stability analysis of the Bareiss and Levinson algorithms for solving a symmetric positive definite Toeplitz system of linear equations. CommentsOnly the Abstract is given here. The full report appeared as [1]. For a revision, see [2]. References[1] A. W. Bojanczyk, R. P. Brent and F. R. de Hoog, Stability Analysis of Fast Toeplitz Linear System Solvers,Report CMA-MR17-91, Centre for Mathematical Analysis, ANU, August 1991, 23 pp. rpb126tr.[2] A. W. Bojanczyk, R. P. Brent, F. R. de Hoog, and D. R. Sweet, “On the stability of the Bareiss and relatedToeplitz factorization algorithms”, SIAM J. Sci. Computing, to appear. rpb144.(Bojanczyk) School of Electrical Engineering, Cornell University, Ithaca, NY 14853(Brent) Computer Sciences Laboratory, Australian National University, Canberra(de Hoog) CSIRO Division of Mathematics and Statistics, GPO Box 1965, Canberra, ACT 2601 1991 Mathematics Subject Classification. Primary 65F05; Secondary 47B35, 65F30, 65Y05, 65Y10.
منابع مشابه
Superfast and Stable Structured Solvers for Toeplitz Least Squares via Randomized Sampling
We present some superfast (O((m + n) log(m + n)) complexity) and stable structured direct solvers for m× n Toeplitz least squares problems. Based on the displacement equation, a Toeplitz matrix T is first transformed into a Cauchy-like matrix C, which can be shown to have small off-diagonal numerical ranks when the diagonal blocks are rectangular. We generalize standard hierarchically semisepar...
متن کاملA Superfast Structured Solver for Toeplitz Linear Systems via Randomized Sampling
We propose a superfast solver for Toeplitz linear systems based on rank structured matrix methods and randomized sampling. The solver uses displacement equations to transform a Toeplitz matrix T into a Cauchy-like matrix C, which is known to have low-numerical-rank offdiagonal blocks. Thus, we design a fast scheme for constructing a hierarchically semiseparable (HSS) matrix approximation to C, ...
متن کاملA Look-ahead Bareiss Algorithm for General Toeplitz Matrices
The Bareiss algorithm is one of the classical fast solvers for systems of linear equations with Toeplitz coeecient matrices. The method takes advantage of the special structure, and it computes the solution of a Toeplitz system of order N with only O(N 2) arithmetic operations, instead of O(N 3) operations. However, the original Bareiss algorithm requires that all leading principal sub-matrices...
متن کاملFast direct solvers for some complex symmetric block Toeplitz linear systems
We consider the solution of a class of complex symmetric block Toeplitz linear systems, arising from integral equations problems. Algorithms that exploit the Toeplitz structure provide considerable savings on the number of arithmetic operations, compared to the classical Cholesky factorization. We propose a fast Schur algorithm adapted to the complex symmetric case. We detail blocked variants, ...
متن کاملBlock pivoting implementation of a symmetric Toeplitz solver
Toeplitzmatrices are characterized by a special structure that can be exploited in order to obtain fast linear system solvers. These solvers are difficult to parallelize due to their low computational cost and their closely coupled data operations. We propose to transform the Toeplitz system matrix into a Cauchy-like matrix since the latter can be divided into two independent matrices of half t...
متن کامل